A Hybrid Approach for Fuzzy Just-In-Time Flow Shop Scheduling with Limited Buffers and Deteriorating Jobs

Authors

  • B. Shirazi
  • I. Mahdavi
  • M. Jannatipour
Abstract:

This paper investigates the problem of just-in-time permutation flow shop scheduling with limited buffers and linear job deterioration in an uncertain environment. The fuzzy set theory is applied to describe this situation. A novel mixed-integer nonlinear program is presented to minimize the weighted sum of fuzzy earliness and tardiness penalties. Due to the computational complexities, the proposed mathematical model is NP-hard and therefore a hybrid meta-heuristic approach based on imperialist competitive algorithm and genetic algorithm (ICA-GA) is designed to tackle the considered flow shop scheduling problem. A set of random test problems with different structures are developed to evaluate the performance of this approach. The results illustrate the effectiveness of the presented model and hybrid algorithm for different problem sizes.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

a hybrid approach for fuzzy just-in-time flow shop scheduling with limited buffers and deteriorating jobs

this paper investigates the problem of just-in-time permutation flow shop scheduling with limited buffers and linear job deterioration in an uncertain environment. the fuzzy set theory is applied to describe this situation. a novel mixed-integer nonlinear program is presented to minimize the weighted sum of fuzzy earliness and tardiness penalties. due to the computational complexities, the prop...

full text

A Mathematical Programming Model for Flow Shop Scheduling Problems for Considering Just in Time Production

  In this paper, we consider a flow shop scheduling problem with bypass consideration for minimizing the sum of earliness and tardiness costs. We propose a new mathematical modeling to formulate this problem. There are several constraints which are involved in our modeling such as the due date of jobs, the job ready times, the earliness and the tardiness cost of jobs, and so on. We apply adapte...

full text

The Preemptive Just-in-time Scheduling Problem in a Flow Shop Scheduling System

Flow shop scheduling problem has a wide application in the manufacturing and has attracted much attention in academic fields. From other point, on time delivery of products and services is a major necessity of companies’ todays; early and tardy delivery times will result additional cost such as holding or penalty costs.  In this paper, just-in-time (JIT) flow shop scheduling problem with preemp...

full text

Simultaneous production planning and scheduling in a hybrid flow shop with time periods and work shifts

Simultaneous production planning and scheduling has been identified as one of the most important factors that affect the efficient implementation of planning and scheduling operations for the production systems. In this paper, simultaneous production planning and scheduling is applied in a hybrid flow shop environment, which has numerous applications in real industrial settings. In this problem...

full text

Lagrangian relaxation algorithms for hybrid flow-shop scheduling problems with limited buffers

In this research, Lagrangian relaxation algorithms are proposed for Hybrid Flow-Shop (HFS) scheduling problems. Conventional HFS consists of a series of production stages, each of which has several identical parallel machines and no buffer spaces are considered. Jobs are processed through all stages in the same direction. In the previous researches, they are assumed that the capacity of buffer ...

full text

An on-line approach to hybrid flow shop scheduling with jobs arriving over time

During the manufacturing process in a steel mill, the chemical composition and quality of raw-iron, steel and slack has to be checked several times. The organization of the corresponding list of operations can be classified as a hybrid flow shop scheduling problem with jobs arriving over time and the objective is to minimize the total weighted completion time. Since this problem is known to be ...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 4  issue None

pages  25- 48

publication date 2014-09

By following a journal you will be notified via email when a new issue of this journal is published.

Keywords

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023